Average Profile of Generalized Digital Search Trees and the Generalized Lempel-Ziv Algorithm

On Generalized Digital Search Trees with Applicationsto a Generalized Lempel - Ziv

The goal of this research is twofold: (i) to analyze generalized digital search trees, and (ii) to derive the average proole (i.e., phrase length) of a generalization of the well known parsing algorithm due to Lempel and Ziv. In the generalized Lempel-Ziv parsing scheme, one partitions a sequence of symbols from a nite alphabet into phrases such that the new phrase is the longest substring seen...

Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm

Average Profile of the Lempel-Ziv Parsing Scheme for Markovian Source

Jing Tang Microsoft Corporation One Microsoft Way, 1/2061 Redmond, WA 98052 U.S.A. [email protected] For a Markovian source, we analyze the Lempel-Ziv parsing scheme that partitions sequences into phrases such that a new phrase is the shortest phrase not seen in the past. We consider three models: In the Markov Independent model, several sequences are generated independently by Markovian sou...

Average Profile of the Lempel - Ziv Parsing Scheme for Amarkovian

For a Markovian source, we analyze the Lempel-Ziv parsing scheme that partitions sequences into phrases such that a new phrase is the shortest phrase not seen in the past. We consider three models: In the Markov Independent model, several sequences are generated independently by Markovian sources, and the ith phrase is the shortest preex of the ith sequence that was not seen before as a phrase ...

Towards Analytical Information Theory: Recent Results on Lempel-Ziv Data Compression Schemes

The Lempel-Ziv algorithms are well-known dynamic dictionary algorithms of use in data compression. The talk shows how analytic models originally developed for the analysis of tries and digital search trees may be used to characterize their compression characteristics.